Dynamic load balancing with flexible workers
نویسندگان
چکیده
منابع مشابه
Dynamic Load Balancing with Flexible Workers
We study the problem of dynamically allocating flexible workers to stations in tandem or serial manufacturing systems. Workers are trained to do a subset of consecutive tasks. We show that the optimal policy is often LBFS (last buffer first-served) or FBFS (first buffer first-served). These results generalize earlier results on the optimality of the pickand-run, expedite, and bucket brigade-typ...
متن کاملDynamic Load Balancing with Tokens
Efficiently exploiting the resources of data centers is a complex task that requires efficient and reliable load balancing and resource allocation algorithms. The former are in charge of assigning jobs to servers upon their arrival in the system, while the latter are responsible for sharing server resources between their assigned jobs. These algorithms should take account of various constraints...
متن کاملDynamic Diffusion Load Balancing
We consider the problem of dynamic load balancing in arbitrary (connected) networks on n nodes. Our load generation model is such that during each round, n tasks are generated on arbitrary nodes, and then (possibly after some balancing) one task is deleted from every nonempty node. Notice that this model fully saturates the resources of the network in the sense that we generate just as many new...
متن کاملDynamic Load Balancing with Pair Potentials
We present a new load balancing algorithm inspired by Molecular Dynamics Simulations. Our main motivation is to anticipate the rising costs of tasks-scheduling caused by the growth of the number of available cores on chips. This algorithm is based on a virtual decomposition of workload in Voronoï cells centered around computing units. The method used in this paper allows cores to virtually move...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2006
ISSN: 0001-8678,1475-6064
DOI: 10.1017/s0001867800001208